Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids

Set systems can be visualized in various ways. An important distinction between techniques is whether the elements have a spatial location that to used for visualization; example, are cities on map. Strictly adhering such may severely limit visualization and force overlay, intersections other forms of clutter. On hand, completely ignoring dimension omits information hide patterns data. We study layouts set (or hypergraphs) which locations displaced onto concentric circles or grid, obtain schematic visualizations. investigate tractability underlying algorithmic problems adopting different optimization criteria (e.g. crossings bends) layout structure, also known as support hypergraph. Furthermore, we describe simulated-annealing approach heuristically optimize combination criteria. Using this method computational experiments, explore trade-offs dependencies computing high-quality